Implementation of Motzkin-Burger algorithm in Maple
نویسنده
چکیده
Subject of this paper is an implementation of a well-known Motzkin-Burger algorithm, which solves the problem of finding the full set of solutions of a system of linear homogeneous inequalities. There exist a number of implementations of this algorithm, but there was no one in Maple, to the best of the author's knowledge.
منابع مشابه
cient Multivariate Factorization Over
We describe the Maple 23] implementation of multivariate factorization over general nite elds. Our rst implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its eeciency. Most of the improvements presented here are incorporated in Maple V Release 4. In particular, we show that we needed a general tool for im...
متن کاملA Modular Algorithm for Computing the Characteristic Polynomial of an Integer Matrix in Maple
Let A be an n × n matrix of integers. In this paper we present details of our Maple implementation of a modular method for computing the characteristic polynomial of A. Our implementation considers several different representations for the computation modulo primes, including the use of double precision floats. The algorithm presently implemented in Maple releases 7–9 is the Berkowitz algorithm...
متن کاملEffect of Adding Lemongrass (Cymbopogon citratus) Extract on Quality Characteristics of Chicken Burger during Frozen Storage
Background: Lemongrass (Cymbopogon citratus) is an aromatic herb; rich source of citric, vitamin C, and phenolic compounds used as natural antioxidant and antibacterial agents in food processing. This study aimed to evaluate the effect of lemongrass extract on the quality properties of chicken burger during frozen storage. Methods: Lemongrass extract was prepared with three levels (0.5, 1.0, a...
متن کاملA Maple Package for Conditional Event Algebras
We present a Maple package for experimenting with conditional event algebras of Schay-Adams-Calabrese, Goodman-Nguyen-Walker and product space of Goodman and Nguyen. It includes the implementation of the first polynomial time algorithm for calculating probabilities in the product space cea.
متن کاملInteger Factorization and Computing Discrete Logarithms in Maple
As part of our MITACS research project at Simon Fraser University, we have investigated algorithms for integer factorization and computing discrete logarithms. We have implemented a quadratic sieve algorithm for integer factorization in Maple to replace Maple’s implementation of the MorrisonBrillhart continued fraction algorithm which was done by Gaston Gonnet in the early 1980’s. We have also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0501003 شماره
صفحات -
تاریخ انتشار 2004